- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by E. M. Fels
44 found
Order:
- Ánov Ú. I.. O logičéskih shémah algoritmov . Problémy kibérnétiki, vol. 1 , pp. 75–127.E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):362-363.
- Ánov Ú. I.. О ravnosil′nosti i préobrazovaniáh shém programm . Doklady Akadémii Nauk SSSR, Vol. 113 , pp. 39–42.E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-391.
- On the Reversibility of Algorithms.E. M. Fels & V. S. Cernavskij - 1966 - Journal of Symbolic Logic 31 (4):655.
- V. S. Čérnávskij. Ob obratimosti algorifmov . Trudy Moskovskogo Matématičéskogo Obščéstva, vol. 9 , pp. 425–453.E. M. Fels - 1966 - Journal of Symbolic Logic 31 (4):655-656.
- Review: N. A. Sanin, Constructive Real Numbers and Constructive Functional Spaces. [REVIEW]E. M. Fels - 1969 - Journal of Symbolic Logic 34 (2):290-292.
- A. A. Lápunov. O logičéskih shémah programm. Problémy kibérnétiki, vol. 1 , pp. 46–74. - A. A. Lyapunov. The logical structure of programmes. English translation of the preceding. Problems of cybernetics, vol. 1 , pp. 48–81. - A. A. Ljapunow. Über logische Programm-Schemata. German translation of the same. Probleme der Kybernetik, vol. 1 , pp. 53–86. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 33 (3):466-467.
- Asser Günter , pp. 20–27) has meanwhile gone farther and shown, inter alia, the equivalence of Kalužnin's graph-schematic algorithm concept with Asser's functional-algorithm concept. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):364-364.
- Asser Günter. Funktionen-Algorithmen und Graphschemata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 20–27. [REVIEW]E. M. Fels - 1963 - Journal of Symbolic Logic 28 (4):292-292.
- A. A. Markov. O konstruktivnyh funkciáh . Problémy konstruktivnogo napravléniá v matématiké, 1, Sbornik rabot, edited by N. A. Šanin, Trudy Maté-matičéskogo Instituta imèni V. A. Stéklova, vol. 52, Izdatél′stvo Akadémii Nauk SSSR, Moscow and Leningrad1958, pp. 315–348. [REVIEW]E. M. Fels - 1966 - Journal of Symbolic Logic 31 (2):255-258.
- A. P. Éršov. Opératornyé algorifmy. II. Problémy kibérnétiki, vol. 8 , pp. 211–233. - A. P. Jerschow. Operator-Algorithmen. II. German translation of the preceding by Heinz D. Modrow. Probleme der Kybernetik, vol. 8 , pp. 208–232. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 33 (3):467.
- G. S. Céjtin. Associativnoé isčslénié s nérazréšimoj problémoj ekvivaléntnosti . Problémy konstruktivnogo napravléniá v matématiké, 1, Sbornik rabot, edited by N. A. Šanin, Trudy Matématičéskogo Instituta iméni V. A. Stéklova, vol. 52, Izdatél'stvo Akadémii Nauk SSSR, Moscow and Leningrad1958, pp. 172–189. [REVIEW]E. M. Fels - 1965 - Journal of Symbolic Logic 30 (2):254-255.
- S. Ú. Maslov. O “Tag”-problémé E. L. Posta . Problémy konstruktivnogo napravléniá v matématiké, 3, Sbornik rabot, edited by N. A. Šanin, Trudy Matématičéskogo Instituta iméni V. A. Stéklova, vol. 72, Izdatél′stvo “Nauka,”Moscow and Leningrad1964, pp. 57–68. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 32 (4):526-527.
- Maslov S. Ú.. Préobrazovanié proizvol′nyh kanoničéskih isčislénij v kanoničéskié isčisléniá spécial′nyh tipov. Doklady Akadémii Nauk SSSR, vol. 147 , pp. 779–782.Maslov S. Ju.. Transformation of arbitrary canonical calculi into canonical calculi of special types. English translation of the preceding by Gdss R. N.. Soviet mathematics, vol. 3 no. 6 , pp. 1708–1711. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 32 (4):527-527.
- S. Ú. Maslov. Nékotoryé svojstva apparata kanoničéskih isčislénij E. L. Posta . Problémy konstruktivnogo napravléniá v matématiké, 3, Sbornik rabot, edited by N. A. Šanin, Trudy Matématičéskogo Instituta iméni V. A. Stéklova, vol. 72, Izdatél′stvo “Nauka,”Moscow and Leningrad1964, pp. 5–56. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 32 (4):524-526.
- N. A. Šanin. Konstruktivnyé véščéstvénnyé ĉisla i konstruktivnyé funkcional'nyé prostranstva (Constructive real numbers and constructive functional spaces). Problémy konstrukticnogo napravléniá v matématik, 2 (Konstruktivnyj matématičéskij analiz), Sbornik rabot, edited by N. A. Šanin, Trudy Matématičéskogo Instituta imèni V. A. Stéklova, vol. 67Izdatél′stvo Akadémii Nauk SSSR, Moscow and Leningrad1962, pp. 15–294. [REVIEW]E. M. Fels - 1969 - Journal of Symbolic Logic 34 (2):290-292.
- N. M. Nagornyj. Nékotoryé obobščénia ponátiá normaľnogo algorifma, . Problémy konstruktivnogo napravléniá v matématiké, 1, Sbornik rabot, edited by N. A. Šanin. Trudy Matématičéskogo Instituta iméni V. A. Stéklova, vol. 52, Izdatéľstvo Akadémii Nauk SSSR, Moscow and Leningrad1958, pp. 7–65. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):360-362.
- N. N. Vorob′év. Novyj algorifm vyvodimosti v konstruktivnom isčislénii uyskazyvanij . Problémy konstruktivnogo napravléniá v matématiké, 1, Sbornik rabot, edited by N. A. Šanin, Trudy Matématičéskogo Instituta imèni V. A. Stéklova, vol. 52, Izdatél′stvo Akadémii Nauk SSSR, Moscow and Leningrad1958, pp. 193–225. [REVIEW]E. M. Fels - 1964 - Journal of Symbolic Logic 29 (2):108-109.
- Review: A. A. Ljapuno, The Logical Structure of Programmes. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 33 (3):466-467.
- Review: A. A. Markov, On Constructive Functions. [REVIEW]E. M. Fels - 1966 - Journal of Symbolic Logic 31 (2):258-258.Export citation
Bookmark - Review: A. P. Jerschow, Heinz D. Modrow, Operator Algorithmen. II. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 33 (3):467-467.
- Review: A. P. Ersov, Operator Algorithms. I. Basic Concepts. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):364-366.
- Korolúk V. S.. O ponátii adrésnogo algoritma . Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 4 , pp. 95–110. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):364-366.
- Review: E. S. Orlovskij, Some Questions in the Theory of Algorithms. [REVIEW]E. M. Fels - 1964 - Journal of Symbolic Logic 29 (2):108-109.Export citation Bookmark
- Review: Gunter Asser, Funktionen-Algorithmen und Graphschemata. [REVIEW]E. M. Fels - 1963 - Journal of Symbolic Logic 28 (4):292-292.
- Review: G. S. Cejtin, Associative Calculus with Unsolvable Equivalence Problem. [REVIEW]E. M. Fels - 1965 - Journal of Symbolic Logic 30 (2):254-255.
- Review: L. A. Kaluznin, On Algorithmization of Mathematical Problems. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):363-364.
- Review: N. A. Sanin, On the Constructive Interpretation of Mathematical Judgments. [REVIEW]E. M. Fels - 1966 - Journal of Symbolic Logic 31 (2):255-258.
- Review: N. M. Nagornyj, Some Generalizations of the Concept of Normal Algorithm. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):360-362.
- Review: N. M. Nagornyj, On a Minimal Alphabet of Algorithms Over a Given Alphabet. [REVIEW]E. M. Fels - 1964 - Journal of Symbolic Logic 29 (2):108-108.Export citation Bookmark
- Review: N. N. Vorob'ev, A New Algorithm of Deducibility in the Constructive Propositional Calculus. [REVIEW]E. M. Fels - 1964 - Journal of Symbolic Logic 29 (2):109-109.
- Review: N. V. Belakin, The Universality of a Computing Machine with Potentially Infinite Exterior Memory. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):366-366.
- Review: S. Ju. Maslov, Transformation of Arbitrary Canonical Calculi into CanonicaL Calculi of Special Types. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (4):527-527.
- Review: S. Ju. Maslov, Elliott Mendelson, Strong Representability of Sets by Calculi. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-392.Export citation Bookmark
- Review: S. U. Maslov, On the "Tag" Problem of E. L. Post. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (4):526-527.
- Review: S. U. Maslov, Some Properties of E. L. Post's Apparatus of Canonical Systems. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (4):524-526.
- Review: S. U. Maslov, Some Methods for the Definition of Sets in Generating Bases. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):392-393.Export citation Bookmark
- Review: U. I. Anov, On Logical Schemata of Algorithms. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):362-363.
- Review: U. I. Anov, On the Equivalence and Transformations of Program Schemata. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-391.Export citation Bookmark
- Review: U. I. Anov, On Matrix Schemata. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-391.
- Review: V. K. Detlovs, The Equivalence of Normal Algorithms and Recursive Functions. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):362-362.
- Review: V. S. Koroluk, On the Concept of Address Algorithm. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):366-366.
- Review: V. S. Cernavskij, On the Reversibility of Algorithms. [REVIEW]E. M. Fels - 1966 - Journal of Symbolic Logic 31 (4):655-656.
- S. Ú. Maslov. O nékotoryh sposobah zadaniá množéstv v bazisah poroždéniá. Doklady Akadémii Nauk SSSR, Vol. 153 , pp. 266–269. - S. Ju. Maslov. Some methods for the definition of sets in generating bases. English translation of the preceding by Avner Falk. Soviet mathematics, vol. 4 no. 6 , pp. 1649–1652. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):392-393.
- S. Ú. Maslov. О strogoj prédstavimosti množéstv isčisléniámi. Doklady Akadémii Nauk SSSR, Vol. 152 , pp. 272–274. - S. Ju. Maslov. Strong representability of sets by calculi. English translation of the preceding by Elliott Mendelson. Soviet mathematics, vol. 4 no. 5 , pp. 1292–1295. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-392.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-747975fc64-c8xzk uwo